Lattice Codes for the Binary Deletion Channel
نویسندگان
چکیده
The construction of deletion codes for the Levenshtein metric is reduced to the construction of codes over the integers for the Manhattan metric by run length coding. The latter codes are constructed by expurgation of translates of lattices. These lattices, in turn, are obtained from Construction A applied to binary codes and Z4−codes. A lower bound on the size of our codes for the Manhattan distance are obtained through generalized theta series of the corresponding lattices.
منابع مشابه
Efficiently Decodable Codes for the Binary Deletion Channel
In the random deletion channel, each bit is deleted independently with probability p. For the random deletion channel, the existence of codes of rate (1− p)/9, and thus bounded away from 0 for any p < 1, has been known. We give an explicit constructionwith polynomial time encoding and deletion correction algorithms with rate c0(1 − p) for an absolute constant c0 > 0.
متن کاملPerformance of Quantizers on Noisy Channels Using Structured Families of Codes
Achievable distortion bounds are derived for the cascade of structured families of binary linear channel codes and binary lattice vector quantizers. It is known that for the cascade of asymptotically good channel codes and asymptotically good vector quantizers the end-to-end distortion decays to zero exponentially fast as a function of the overall transmission rate, and is achieved by choosing ...
متن کاملBinary Lattice Vector Quantization with Linear Block Codes and Affine Index Assignments
We determine analytic expressions for the performance of some low-complexity combined source-channel coding systems. The main tool used is the Hadamard transform. In particular, we obtain formulas for the average distortion of binary lattice vector quantization with affine index assignments, linear block channel coding, and a binary-symmetric channel. The distortion formulas are specialized to ...
متن کاملPerformance of Quantizers on Noisy Channels
Achievable distortion bounds are derived for the cascade of structured families of binary linear channel codes and binary lattice vector quantizers. It is known that for the cascade of asymptotically good channel codes and asymptotically good vector quantizers the end-to-end distortion decays to zero exponentially fast as a function of the overall transmission rate, and is achieved by choosing ...
متن کاملTwo Approaches to the Construction of Deletion Correcting Codes: Weight Partitioning and Optimal Colorings
We consider the problem of constructing deletion correcting codes over a binary alphabet and take a graph theoretic view. An n-bit s-deletion correcting code is an independent set in a particular graph. We propose constructing such a code by taking the union of many constant Hamming weight codes. This results in codes that have additional structure. Searching for codes in constant Hamming weigh...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- CoRR
دوره abs/1406.1055 شماره
صفحات -
تاریخ انتشار 2014